Formal Reasoning about Modules, Reuse and their Correctness

data types and in capturing their recursiveness. Fundamenta Informaticae VI(2):127–170, 1983. 2. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM TOPLAS 16(4):1361-1398, 1994. 3. K.M. Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. J. Functional Programming 4(2):127–206, 1994. 4. M. Bugliesi, E. Lamma and P. Mello. Modularity in logic programming. J. Logic Programming 19,20:443–502, 1994. Special issue: Ten years of logic programming. 5. C.C. Chang and H.J. Keisler. Model Theory . North-Holland, 1973. 6. J.A. Goguen and R.M. Burstall. Institutions: Abstract model theory for specification and programming. J. ACM 39(1):95–146, 1992. 7. K.K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94 , LNCS 883, pages 104–121, Springer-Verlag, 1994. 8. K.K. Lau, M. Ornaghi and S.-.Å. Tärnlund. The halting problem for deductivesynthesis of logic programs. In P. van Hentenryck, editor, Proc. 11 Int. Conf. on Logic Programming , pages 665–683, MIT Press, 1994. 9. K.K. Lau, M. Ornaghi and S.-.Å. Tärnlund. Steadfast logic programs. Submitted 10. J.W. Lloyd. Foundations of Logic Programming , Springer-Verlag, 1987. 11. B. Meyer. Eiffel the Language. Prentice Hall, 1992. 12. P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp.